github.com/klauspost/compress/huff0.cTableEntry.nBits (field)

29 uses

	github.com/klauspost/compress/huff0 (current package)
		bitwriter.go#L29: 		if enc.nBits == 0 {
		bitwriter.go#L33: 	b.nBits += enc.nBits
		bitwriter.go#L42: 	combined := uint64(encA.val) | (uint64(encB.val) << (encA.nBits & 63))
		bitwriter.go#L45: 		if encA.nBits == 0 {
		bitwriter.go#L48: 		if encB.nBits == 0 {
		bitwriter.go#L52: 	b.nBits += encA.nBits + encB.nBits
		bitwriter.go#L59: 	bitsA := encA.nBits
		bitwriter.go#L60: 	bitsB := bitsA + encB.nBits
		bitwriter.go#L61: 	bitsC := bitsB + encC.nBits
		bitwriter.go#L62: 	bitsD := bitsC + encD.nBits
		compress.go#L369: 			} else if s.prevTable[i].nBits == 0 {
		compress.go#L392: 		if v != 0 && c[i].nBits == 0 {
		compress.go#L406: 			if c[i].nBits == 0 {
		compress.go#L409: 			if c[i].nBits > s.actualTableLog {
		compress.go#L451: 	nBits uint8
		compress.go#L554: 		s.cTable[v.symbol()].nBits = v.nbBits()
		compress.go#L560: 		nbits := val.nBits & 15
		decompress.go#L146: 				nBits: 0,
		decompress.go#L158: 			nBits: uint8(d.entry),
		decompress.go#L1106: 		if enc.nBits == 0 {
		decompress.go#L1120: 		ub := tablelog - enc.nBits
		decompress.go#L1124: 		if uint8(dec.entry) != enc.nBits {
		decompress.go#L1125: 			fmt.Fprintf(w, "symbol 0x%x bit size mismatch (enc: %d, dec:%d).\n", sym, enc.nBits, uint8(dec.entry))
		decompress.go#L1140: 			if uint8(dec.entry) != enc.nBits {
		decompress.go#L1141: 				fmt.Fprintf(w, "symbol 0x%x bit size mismatch (enc: %d, dec:%d).\n", vval, enc.nBits, uint8(dec.entry))
		huff0.go#L205: 		v := bitsToWeight[c[n].nBits] & 15
		huff0.go#L275: 		v := bitsToWeight[c[n].nBits] & 15
		huff0.go#L317: 		nbBits += uint32(v.nBits) * hist[i]